A Novel Banking Supervision Method Using the Minimum Dominating Set
نویسندگان
چکیده
منابع مشابه
An independent dominating set in the complement of a minimum dominating set of a tree
We prove that for every tree T of order at least 2 and every minimum dominating set D of T which contains at most one endvertex of T , there is an independent dominating set I of T which is disjoint from D. This confirms a recent conjecture of Johnson, Prier, and Walsh.
متن کاملConstruction of minimum connected dominating set in wireless sensor networks using pseudo dominating set
In a wireless network, messages need to be sent on in an optimized way to preserve the energy of the network. A minimum connected dominating set (MCDS) offers an optimized way of sending messages. However, MCDS construction is a NP-Hard problem. In this paper, we propose a new degree-based greedy approximation algorithm named as Connected Pseudo Dominating Set Using 2 Hop Information (CPDS2HI),...
متن کاملMinimum Dominating Set for a Point Set in $\IR^2$
In this article, we consider the problem of computing minimum dominating set for a given set S of n points in R. Here the objective is to find a minimum cardinality subset S of S such that the union of the unit radius disks centered at the points in S covers all the points in S. We first propose a simple 4-factor and 3-factor approximation algorithms in O(n log n) and O(n logn) time respectivel...
متن کاملConstructing Minimum Connected Dominating Set: Algorithmic approach
Connected Dominating Set is popularly used for constructing virtual backbones for broadcasting operation in WSNs. UD Graph is the most suitable model for a wireless sensor network. In this paper we provide an algorithm to find MCDS in UD Graph. It is based on the computation of convex hulls of sensor nodes or vertices. Constructing a virtual backbone in WSNs is an important issue because it red...
متن کاملGraph Neural Network for Minimum Dominating Set
The dominating set concept in graphs has been used in many applications. In large graphs finding the minimum dominating set is difficult. The minimum dominating set problem in graphs seek a set D of minimum number of vertices such that each vertex of the graph is either in D or adjacent to a vertex in D. In a graph on n nodes if there is a single node of degree n-1 then that single node forms a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2014
ISSN: 1556-5068
DOI: 10.2139/ssrn.2386155